The Cyclic Towers of Hanoi
نویسنده
چکیده
The famous Towers of Hanoi puzzle consists of 3 pegs (A, B, C) on one of which (A) are stacked n rings of different sizes, each ring resting on a larger ring. The objective is to move the n rings one by one until they are all stacked on another peg (B) in such a way that no ring is ever placed on a smaller ring; the other peg (C) can be used as workspace. The problem has tong been a favourite iir programming courses as one which admits a concise recursive solution. This solution hinges on the observation that, when the largest ring is moved from A to B, the n 1 remaining rings must all be on peg C. This immediately leads to the recursive procedure
منابع مشابه
Schreier Spectrum of the Hanoi Towers Group on Three Pegs
Finite dimensional representations of the Hanoi Towers group are used to calculate the spectra of the finite graphs associated to the Hanoi Towers Game on three pegs (the group serves as a renorm group for the game). These graphs are Schreier graphs of the action of the Hanoi Towers group on the levels of the rooted ternary tree. The spectrum of the limiting graph (Schreir graph of the action o...
متن کاملEvaluation of the Story Driven Modeling Methodology: From Towers to Models
Story Driven Modeling (SDM [1], [2]) aims to provide a systematic approach to turn requirements scenario’s in class structures and method implementations. It extends nounverb analysis [3], Object Role Modeling (ORM [4]) and CRC cards [5] both notationally and methodologically. More specifically, it provides a notation for recording use case scenario’s and a derivation strategy for generalizing ...
متن کاملModified Hanoi Towers Groups and Limit Spaces
We introduce the k-peg Hanoi automorphisms and Hanoi self-similar groups, a generalization of the Hanoi Towers groups, and give conditions for them to be contractive. We analyze the limit spaces of a particular family of contracting Hanoi groups, H (k) c , and show that these are the unique maximal contracting Hanoi groups under a suitable symmetry condition. Finally, we provide partial results...
متن کاملOn the Solution of the Towers of Hanoi Problem
In this paper, two versions of an iterative loopless algorithm for the classical towers of Hanoi problem with O(1) storage complexity and O(2) time complexity are presented. Based on this algorithm the number of different moves in each of pegs with its direction is formulated. Keywords—Loopless algorithm, Binary tree, Towers of Hanoi.
متن کاملHamiltonianicity of the Towers of Hanoi Problem
In this paper we analyze a variant of the n-disk Towers of Hanoi problem with an arbitrary starting and ending configuration using transition graphs representing valid configurations. In particular, we show that starting with any configuration, there is a sequence of moves that goes through each valid configuration exactly once and back to the starting configuration. Also, we show how the origi...
متن کاملTwin Towers of Hanoi
In the Twin Towers of Hanoi version of the well known Towers of Hanoi Problem there are two coupled sets of pegs. In each move, one chooses a pair of pegs in one of the sets and performs the only possible legal transfer of a disk between the chosen pegs (the smallest disk from one of the pegs is moved to the other peg), but also, simultaneously, between the corresponding pair of pegs in the cou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 13 شماره
صفحات -
تاریخ انتشار 1981